A Formal Context for Acyclic Join Dependencies
نویسنده
چکیده
Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA.
منابع مشابه
A Complete Axiomatization of Full Acyclic Join Dependencies
A sound and complete formal system for full acyclic join dependencies is obtained by adding three derivation rules to the axioms of multivalued dependencies. 0 1998 Elsevier Science B.V. All rights reserved.
متن کاملInteraction-Free Multivalued Dependency Sets
Multivalued dependencies (MVD) and join dependencies were introduced to study database design problems. Join dependencies can be divided into cyclic and acyclic join dependencies. A fundamental result in dependency theory is that a join Dependency is acyclic if and only if it is equivalent to a set of MVDs. In addition to this characterization it has been shown that such a set of MVDs has a cov...
متن کاملConstructing the Bayesian network structure from dependencies implied in multiple relational schemas
Relational models are the most common representation of structured data, and acyclic database theory is important in relational databases. In this paper, we propose the method for constructing the Bayesian network structure from dependencies implied in multiple relational schemas. Based on the acyclic database theory and its relationships with probabilistic networks, we are to construct the Bay...
متن کاملFormal Systems For
We investigate whether a sound and complete formal system for join dependencies can be found. We present a system that is sound and complete for tuple generating dependencies and is strong enough to derive join dependencies from join dependencies using only generalized join dependencies in the derivation. We also present a system that sound and complete for tuple generating dependencies and is ...
متن کاملJoin Ordering for Constraint Handling Rules
Join ordering is the problem of finding cost optimal execution plans for matching multi-headed rules. In the context of Constraint Handling Rules, this topic has received limited attention so far, even though it is of great importance for efficient CHR execution. We present a formal cost model for joins and investigate the possibility of join optimization at runtime. We propose some heuristic a...
متن کامل